Multi-Pareto-Ranking Evolutionary Algorithm
نویسندگان
چکیده
This paper proposes a new multi-objective genetic algorithm, called GAME, to solve constrained optimization problems. GAME uses an elitist archive, but it ranks the population in several Pareto fronts. Then, three types of fitness assignment methods are defined: the fitness of individuals depends on the front they belong to. The crowding distance is also used to preserve diversity. Selection is based on two steps: a Pareto front is first selected, before choosing an individual among the solutions it contains. The probability to choose a given front is computed using three parameters which are tuned using the design of experiments. The influence of the number of Pareto fronts is studied experimentally. Finally GAME’s performance is assessed and compared with three other algorithms according to the conditions of the CEC 2009 competition.
منابع مشابه
Power System Stability Improvement via TCSC Controller Employing a Multi-objective Strength Pareto Evolutionary Algorithm Approach
This paper focuses on multi-objective designing of multi-machine Thyristor Controlled Series Compensator (TCSC) using Strength Pareto Evolutionary Algorithm (SPEA). The TCSC parameters designing problem is converted to an optimization problem with the multi-objective function including the desired damping factor and the desired damping ratio of the power system modes, which is solved by a SPEA ...
متن کاملPareto-based Multi-criteria Evolutionary Algorithm for Parallel Machines Scheduling Problem with Sequence-dependent Setup Times
This paper addresses an unrelated multi-machine scheduling problem with sequence-dependent setup time, release date and processing set restriction to minimize the sum of weighted earliness/tardiness penalties and the sum of completion times, which is known to be NP-hard. A Mixed Integer Programming (MIP) model is proposed to formulate the considered multi-criteria problem. Also, to solve the mo...
متن کاملSolving Multi-objective Optimal Control Problems of chemical processes using Hybrid Evolutionary Algorithm
Evolutionary algorithms have been recognized to be suitable for extracting approximate solutions of multi-objective problems because of their capability to evolve a set of non-dominated solutions distributed along the Pareto frontier. This paper applies an evolutionary optimization scheme, inspired by Multi-objective Invasive Weed Optimization (MOIWO) and Non-dominated Sorting (NS) strategi...
متن کاملApproximate Pareto Optimal Solutions of Multi objective Optimal Control Problems by Evolutionary Algorithms
In this paper an approach based on evolutionary algorithms to find Pareto optimal pair of state and control for multi-objective optimal control problems (MOOCP)'s is introduced. In this approach, first a discretized form of the time-control space is considered and then, a piecewise linear control and a piecewise linear trajectory are obtained from the discretized time-control space using ...
متن کاملA Hybrid Simplex Multi-Objective Evolutionary Algorithm Based on A New Fitness Assignment Strategy
In multi-objective evolutionary algorithms (MOEAs), the traditional fitness assignment strategy based on Pareto dominance is ineffective in sorting out the highquality solutions when the number of the objective is large. Recently, many scholars have used preference order (PO) ranking approach as an optimality criterion in the ranking stage of MOEAs. The experiment shows that the algorithms equi...
متن کاملInterval-based ranking in noisy evolutionary multi-objective optimization
As one of the most competitive approaches to multi-objective optimization, evolutionary algorithms have been shown to obtain very good results for many realworld multi-objective problems. One of the issues that can affect the performance of these algorithms is the uncertainty in the quality of the solutions which is usually represented with the noise in the objective values. Therefore, handling...
متن کامل